Primary Vertex Finding in Multivertex Events

نویسندگان

  • I. Kisel
  • M. Zyzak
چکیده

In the CBM experiment [1] the Kalman filter based algorithm of primary vertex reconstruction is implemented [2]. The algorithm is developed for the case of single primary vertex events: all found tracks are used for the primary vertex reconstruction. The multivertex events availability is assumed by the physics program of the CBM experiment. In case of the multivertex event the situation is more complicated: the number of interaction points is unknown and there is no information about the belonging of the certain track to the certain vertex. Another problem is related to events with low track multiplicity. In this case the currently implemented algorithm will be very sensitive to each measurement, where measurements are tracks included to the primary tracks clusters. If the tracks, which are created by the secondary particles, are included into this primary tracks clusters the errors of the reconstructed primary vertex position could be increased dramatically and the position could be determined incorrect. Therefore the goal of this investigation is to develop the algorithm, which should determine the number of primary vertices and find the clusters of primary tracks, which form each vertex. The developed cluster finder algorithm is based on two assumptions: there is only one target and all primary vertices are positioned on the target. The algorithm consists of the following steps:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Mountain-Valley Assignments for Flat Folds

We develop a combinatorial model of paperfolding for the purposes of enumeration. A planar embedding of a graph is called a crease pattern if it represents the crease lines needed to fold a piece of paper into something. A flat fold is a crease pattern which lies flat when folded, i.e. can be pressed in a book without crumpling. Given a crease pattern C = (V, E), a mountain-valley (MV) assignme...

متن کامل

Conference Record

This document presents a transform-based approach to primary signal vertex finding feasibility analysis. An algorithm to find primary vertices has been developed using only Inner Detector measurements. Based on the information available to the algorithm, a metric has been developed to identify the signal vertex. The feasibility analysis demonstrates the theoretical distinguishability of differe...

متن کامل

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...

متن کامل

Se p 20 09 COMBINATORIAL DESCRIPTIONS OF MULTI - VERTEX 2 - COMPLEXES

Group presentations are implicit descriptions of 2-dimensional cell complexes with only one vertex. While such complexes are usually sufficient for topological investigations of groups, multi-vertex complexes are often preferable when the focus shifts to geometric considerations. In this article, I show how to quickly describe the most important multivertex 2-complexes using a slight variation ...

متن کامل

New vertex reconstruction algorithms for CMS

Vertex reconstruction algorithms face new challenges in high-luminosity scenarios such as the LHC experiments. Vertex finding algorithms have to be able to disentangle the tracks of vertices in difficult topologies, such as from decay vertices which are very close to the primary vertex or decay chains with very small separations between the vertices. Vertex fitters will need to be robustified, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010